Multiprocessor Task Graph Scheduling Using a Novel Graph-Like Learning Automata
نویسندگان
چکیده
منابع مشابه
Multiprocessor Task Graph Scheduling Using a Novel Graph-Like Learning Automata
Optimized task scheduling is one of the most important challenges in multiprocessor environments such as parallel and distributed systems. In such these systems, each parallel program is decomposed into the smaller segments so-called tasks. Task execution times, precedence constrains and communication costs are modeled by using a directed acyclic graph (DAG) named task graph. The goal is to min...
متن کاملTask Graph Scheduling Using Timed Automata
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, originally developed for verification of real-time programs and digital circuits and more recently adapted for solving time-optimal scheduling problems. In this framework, the scheduling problem admits a state-space repr...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملUsing ant colonies to solve multiprocessor task graph scheduling
The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer. In this paper, we propose an application of the Ant Colony...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Grid and Distributed Computing
سال: 2015
ISSN: 2005-4262,2005-4262
DOI: 10.14257/ijgdc.2015.8.1.05